Reliable and Rapidly-Converging ICP Algorithm Using Multiresolution Smoothing

نویسندگان

  • Kok-Lim Low
  • Anselmo Lastra
چکیده

Autonomous range acquisition for 3D modeling requires reliable range registration, for both the precise localization of the sensor and combining the data from multiple scans for view-planning computation. We introduce and present a novel approach to improve the reliability and robustness of the ICP (Iterative Closest Point) 3D shape registration algorithm by smoothing the shape’s surface into multiple resolutions. These smoothed surfaces are used in place of the original surface in a coarse-to-fine manner during registration, which allows the algorithm to avoid being trapped at local minima close to the global optimal solution. We used the technique of multiresolution analysis to create the smoothed surfaces efficiently. Besides being more robust, convergence is generally much faster, especially when combined with the point-to-plane error metric of Chen

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-Resolution ICP with Heuristic Closest Point Search for Fast and Robust 3D Registration of Range Images

The iterative closest point (ICP) algorithm is widely used for the registration of 3D geometric data. One of the main drawbacks of the algorithm is its quadratic time complexity O(N) with the number of points N. Consequently, several methods have been proposed to accelerate the process. This paper presents a new solution for the speeding up of the ICP algorithm and special care is taken to avoi...

متن کامل

A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration

The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N) with the shapes number of points N, which implies long processing time, especially when using high resolution data. This paper proposes to accelerate the process by a coarse to fine multiresolution approach in which a solution at a co...

متن کامل

Constrained Fairing for Meshes

In this paper, we present a novel fairing algorithm for the removal of noise from uniform triangular meshes without shrinkage and serious distortion. The key feature of this algorithm is to keep all triangle centers invariant at each smoothing step by including some constraints in the energy minimization functional. The constrained functional is then minimized efficiently using an iterative met...

متن کامل

A Multiscale Smoothing Algorithm for Pairwise Markov Trees

An important problem in multiresolution analysis of signals and images consists in restoring continuous hidden random variables x = {xs}s∈S from observed ones y = {ys}s∈S . This is done classically in the context of Hidden Markov Trees (HMT). HMT have been generalized recently to Pairwise Markov Trees (PMT). In this paper we propose a smoothing restoration algorithm for Gaussian PMT.

متن کامل

A robust and blind 3D watermarking algorithm using multiresolution adaptive parameterization of surface

A new watermarking scheme based on classification of vertices is proposed for 3D mesh models. The multiresolution adaptive parameterization of surface (MAPS) approach is used to categorize the vertices of the model into two levels: the vertices at the coarse level are used to establish an invariant space; some vertices of the fine level are selected as feature vertices to carry the watermarking...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003